Cycles of all lengths in arc-3-cyclic semicomplete digraphs

نویسندگان

  • Marjorie Darrah
  • Yi-Ping Liu
  • Cun-Quan Zhang
چکیده

Let D be an arc-3-cyclic, semicomplete digraph and uv be an arc of D contained in a cycle of length r. If vu f[ A(D) then the arc uv is contained in cycles of length h : 3<.h<<.r, or if 6+(D),f-(D)>~3 then the arc uv is contained in cycles of length h : 6<~h<~r. Also included in this paper is a very useful crossing arc theorem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A classification of arc-locally semicomplete digraphs

Tournaments are without doubt the best studied class of directed graphs [3, 6]. The generalizations of tournaments arise in order to extend the well-known results on tournaments to more general classes of directed graphs. Moreover, the knowledge about generalizations of tournaments has allowed to deepen our understanding of tournaments themselves. The semicomplete digraphs, the semicomplete mul...

متن کامل

Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey

A digraph obtained by replacing each edge of a complete m-partite graph by an arc or a pair of mutually opposite arcs with the same end vertices is called a semicomplete m-partite digraph. We describe results (theorems and algorithms) on directed walks in semicomplete mpartite digraphs including some recent results concerning tournaments.

متن کامل

LOCALLY SEMICOMPLETE DIGRAPHS WITH A FACTOR COMPOSED OF k CYCLES

A digraph is locally semicomplete if for every vertex x, the set of in-neighbors as well as the set of out-neighbors of x induce semicomplete digraphs. Let D be a k-connected locally semicomplete digraph with k ≥ 3 and g denote the length of a longest induced cycle of D. It is shown that if D has at least 7(k− 1)g vertices, then D has a factor composed of k cycles; furthermore, if D is semicomp...

متن کامل

Solution of a Conjecture of Volkmann on the Number of Vertices in Longest Paths and Cycles of Strong Semicomplete Multipartite Digraphs

A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mutually opposite arcs with the same end vertices is called a semicomplete multipartite digraph. L. Volkmann conjectured that l ≤ 2c− 1, where l (c, respectively) is the number of vertices in a longest path (longest cycle) of a strong semicomplete multipartite digraph. The bound on l is sharp. We s...

متن کامل

On k-strong and k-cyclic digraphs

Thomassen proved that there is no degree of strong connectivity which guarantees a cycle through two given vertices in a digraph (Combinatorica 11 (1991) 393-395). In this paper we consider a large family of digraphs, including symmetric digraphs (i.e. digraphs obtained from undirected graphs by replacing each edge by a directed cycle of length two), semicomplete bipartite digraphs, locally sem...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 173  شماره 

صفحات  -

تاریخ انتشار 1997